Search results for "operational semantics"

showing 9 items of 9 documents

Jason Intentional Learning: An Operational Semantics

2013

This paper introduces an operational semantics for defining Intentional Learning on Jason, the well known Java-based implementation of AgentSpeak(L). This semantics enables Jason to define agents capable of learning the reasons for adopting intentions based on their own experience. In this work, the use of the term Intentional Learning is strictly circumscribed to the practical rationality theory where plans are predefined and the target of the learning processes is to learn the reasons to adopt them as intentions. Top-Down Induction of Logical Decision Trees (TILDE) has proved to be a suitable mechanism for supporting learning on Jason: the first-order representation of TILDE is adequate t…

Javabusiness.industryComputer scienceSemantics (computer science)Decision treeRationalityTildeOperational semanticsTerm (time)Artificial intelligencebusinessRepresentation (mathematics)computercomputer.programming_language
researchProduct

Linear Types for Higher Order Processes with First Class Directed Channels

1995

Abstract We present a small programming language for distributed systems based on message passing processes. In contrast to similar languages, channels are one-to-one connections between a unique sender and a unique receiver process. Process definitions and channels are first class values and the topology of process systems can change dynamically. The operational semantics of the language is defined by means of graph rewriting rules. A static type system based on the notion of linear types ensures that channels are always used as one-to-one connections.

process algebrasGraph rewritinggraph rewritingTheoretical computer scienceGeneral Computer ScienceProcess (engineering)Computer scienceMessage passinglinear typesTopology (electrical circuits)Communicating sequential processesType (model theory)Operational semanticsTheoretical Computer Scienceoperational semanticsComputer Science::Programming Languagesdistributed programmingcomputerComputer Science(all)Computer Science::Information Theorycomputer.programming_languageElectronic Notes in Theoretical Computer Science
researchProduct

Multi-pass execution of functional logic programs

1994

An operational semantics for functional logic programs is presented. In such programs functional terms provide for reduction of expressions, provided that they ground. The semantics is based on multi-pass evaluation techniques originally developed for attribute grammars. Program execution is divided into two phases: (1) construction of an incomplete proof tree, and (2) its decoration into a complete proof tree. The construction phase applies a modified SLD-resolution scheme, and the decoration phase a partial (multi-pass) traversal over the tree. The phase partition is generated by static analysis where data dependencies are extracted for the functional elements of the program. The method g…

Scheme (programming language)Theoretical computer scienceComputer scienceSemantics (computer science)Programming languageStatic analysiscomputer.software_genrePartition (database)Operational semanticsTree (data structure)Tree traversalRule-based machine translationcomputercomputer.programming_languageProceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94
researchProduct

Use of a Semantic Language to Reduce the Indeterminacy in Agents Communication

2014

In the field of agent communications uncertainty and vagueness in the message content and in the achievable results play a primordial role when two agents (human or artificial) communicate. Even though the importance of vagueness and uncertainty has been recognized long ago, only recently mechanisms related to the communications’ semantics that allow a practical approach have been designed; more specifically, the development of tools such as agent programming languages and frameworks, which is a field of intensive research. On the other hand, recent theoretical ideas, drawn from situation semantics theory and the works of Sutton on semantic information, support this work. This paper applies…

ta113business.industryComputer scienceVaguenessSemanticsOperational semanticscommunications semanticsSoftware agentWell-founded semanticsHuman–computer interactionmulti-agent systems programming languageFourth-generation programming languageArtificial intelligenceFifth-generation programming languageta518businessProgramming language theory
researchProduct

Graph-grammar semantics of a higher-order programming language for distributed systems

1994

We will consider a new tiny, yet powerful, programming language for distributed systems, called DHOP, which has its operational semantics given as algebraic graph rewrite rules in a certain category of labeled graphs. Our approach allows to separate actions which affect several processes from local changes such as variable bindings. We also sketch how to derive an implementation from this specification.

Graph rewritingTheoretical computer scienceComputer scienceProgramming languageDistributed computingcomputer.software_genreAbstract semantic graphOperational semanticsAction semanticsDenotational semanticsWell-founded semanticsComputer Science::Programming LanguagescomputerFailure semanticsProgramming language theory
researchProduct

A Formalism Supplementing Cognitive Semantics Based on Mereology

2007

ABSTRACT This paper is motivated by and aims to supplement Cognitive Semantics. Details of this latter prominent approach within contemporary linguistic research will not be discussed here. Rather, we focus on a formalization of the concept of Gestalt and provide a formal semantics that can be used to interpret a certain formal language (LM 0) with respect to a universe of structured wholes (Gestalts). Since a great deal of the analyses of linguistic organization that has been provided by Cognitive Semantics since the mid-1970s is based on the concept of Gestalt, the semantics unfolded in the following may be viewed as an attempt to provide a starting point for supplementing the yet informa…

Cognitive scienceComputer scienceFormal semantics (linguistics)Cognitive semanticsExperimental and Cognitive PsychologyComputer Graphics and Computer-Aided DesignOperational semanticsLinguisticsAction semanticsDenotational semanticsWell-founded semanticsModeling and SimulationComputational semanticsFormal languageComputer Vision and Pattern RecognitionEarth-Surface ProcessesSpatial Cognition & Computation
researchProduct

Object-Oriented Operational Semantics

2016

Operational semantics is one way of providing meaning to an executable language. On a high level of abstraction, operational semantics means to define an interpreter or an abstract machine for the language. In this article, we review the concept of operational semantics in the scope of meta-model-based language definitions and identify challenges and issues. We provide a clean conceptual approach using an object-oriented runtime environment and state change operations, which relies on an underlying abstract virtual machine. We present the approach using a sample language.

Computer scienceProgramming language0102 computer and information sciences02 engineering and technologycomputer.file_formatcomputer.software_genre01 natural sciencesOperational semanticsAbstract machineAction semanticsDenotational semantics010201 computation theory & mathematicsVirtual machine0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingExecutablecomputerInterpreterAbstraction (linguistics)
researchProduct

MLOG: a strongly typed confluent functional language with logical variables

1994

Poirriez, V., MLOG: a strongly typed confluent functional language with logical variables, Theoretical Computer Science 122 (1994) 201-223. A new programming language called MLOG is introduced. MLOG is a conservative extension of ML with logical variables. To validate our concepts, a compiler named CAML Light FLU0 was implemented. Numerous examples are presented to illustrate the possibilities of MLOG. The pattern matching of ML is kept for X-calculus bindings and an unification primitive is introduced for the logical variables bindings. A suspension mechanism allows cohabitation of pattern-matching and logical variables, Although the evaluation strategy for the application is fixed, the or…

Functional programmingEvaluation strategyTheoretical computer scienceGeneral Computer ScienceCamlUnificationcomputer.software_genreOperational semanticsTheoretical Computer ScienceAlgebraTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESConservative extensionPattern matchingCompilercomputercomputer.programming_languageMathematicsComputer Science(all)Theoretical Computer Science
researchProduct

Using Semantics in the Environment for Multiagent-Based Simulation

2014

In this chapter, we carry out an overview and analysis of the usage of semantics to enhance environments in the domain of multiagent-based simulations. Firstly, we take a look at what a multiagent system (MAS) is, and after that we look at the environment for these systems, and why semantics are required in it. Various propositions to put semantics in the environment for MAS are then reviewed, as well as the strengths and weaknesses for these approaches. These propositions are grouped together under two categories, regarding whether the proposed approach is based on only the environment or on both the agents and the environment. The paper is then concluded with findings that have emerged by…

Denotational semanticsProgramming languageComputer scienceSemantics (computer science)Multiagent based simulationcomputer.software_genreComputingMethodologies_ARTIFICIALINTELLIGENCEcomputerOperational semantics
researchProduct